Reliable algorithms for computing minimal dynamic covers
نویسنده
چکیده
Minimal dimension dynamic covers play an important role in solving the structural synthesis problems of minimum order functional observers or fault detectors, or in computing minimal order inverses or minimal degree solutions of rational equations. We propose numerically reliable algorithms to compute two basic types of minimal dimension dynamic covers for a linear system. The proposed approach is based on a special controllability staircase condensed form of a structured pair (A, [B1, B2]), which can be computed using exclusively orthogonal similarity transformations. Using such a condensed form minimal dimension covers and corresponding feedback/feedforward matrices can be easily computed. The overall algorithm has a low computational complexity and is provably numerically reliable.
منابع مشابه
Reliable algorithms for computing minimal dynamic covers for descriptor systems
Minimal dimension dynamic covers play an important role in solving the structural synthesis problems of minimum order functional observers or fault detectors, or in computing minimal order inverses or minimal degree solutions of rational equations. We propose numerically reliable algorithms to compute two basic types of minimal dimension dynamic covers for a linear system. The proposed approach...
متن کاملComparing Algorithms for Computing Lower Covers of Implication-closed Sets
In this paper, we consider two methods for computing lower cover of elements in closure systems for which we know an implicational basis: intersecting meet-irreducible elements or computing minimal transversals of sets of minimal generators. We provide experimental results on the runtimes for single computations of lower covers and depth-first searches.
متن کاملComputation of least order solutions of linear rational equations A . Varga
We propose a numerically reliable approach for computing solutions of least McMillan order of linear equations with rational matrix coefficients. The main computational ingredients are the orthogonal reduction of the associated system matrix pencil to a certain Kronecker-like staircase form and the solution of a minimal dynamic cover design problem. For these computations we discuss numerically...
متن کاملIssues in Accurate and Reliable Use of Parallel Computing in Numerical Programs
Parallel computing, as used in technical computing, is fundamentally about achieving higher performance than is possible with a uniprocessor. The unique issues for accurate and reliable computing are thus directly related to this desire for performance. This chapter briefly covers the major types of parallel computers, the programming models used with them, and issues in the choice and implemen...
متن کاملEfficient O(sqrt(n)) BIST Algorithms for DDNPS Faults in Dual-Port Memories
The testability problem of dual port memories is investigated. Architectural modifications to enhance the testability by allowing multiple access of memory cells with minimal overhead on both silicon area and device performance are described. New fault models are proposed and efficient O( n ) test algorithms are described for both the memory array and the address decoders. The new fault models ...
متن کامل